Secure Multiparty Computation 4.1.1 Overview of Dining Cryptographers (dc) Problem . . . . . . . . . . . 41 List of Figures

Ray Kresman, Advisor Data mining algorithms help reveal hidden information in a repository. Distributed mining algorithms meet this need by distributing data and computation. One of the most important issues of these algorithms is how to safely mine the data. Secure Multiparty Computation (SMC), a framework for safe mining of distributed data, provides some security promises of the computation. This thesis addresses certain aspects of SMC including the role of Hamiltonian and edge-disjoint Hamiltonian cycles. We formalize the notion of trust in a network and show that certain network configurations are better than others. We propose and analyze an algorithm for id assignment in networks that outperforms an existing algorithm.